31 research outputs found
Circuit Lower Bounds, Help Functions, and the Remote Point Problem
We investigate the power of Algebraic Branching Programs (ABPs) augmented
with help polynomials, and constant-depth Boolean circuits augmented with help
functions. We relate the problem of proving explicit lower bounds in both these
models to the Remote Point Problem (introduced by Alon, Panigrahy, and Yekhanin
(RANDOM '09)). More precisely, proving lower bounds for ABPs with help
polynomials is related to the Remote Point Problem w.r.t. the rank metric, and
for constant-depth circuits with help functions it is related to the Remote
Point Problem w.r.t. the Hamming metric. For algebraic branching programs with
help polynomials with some degree restrictions we show exponential size lower
bounds for explicit polynomials
Parameterized Complexity of Small Weight Automorphisms
We show that checking if a given hypergraph has an automorphism that moves exactly k vertices is fixed parameter tractable, using k and additionally either the maximum hyperedge size or the maximum color class size as parameters. In particular, it suffices to use k as parameter if the hyperedge size is at most polylogarithmic in the size of the given hypergraph.
As a building block for our algorithms, we generalize Schweitzer\u27s FPT algorithm [ESA 2011] that, given two graphs on the same vertex set and a parameter k, decides whether there is an isomorphism between the two graphs that moves at most k vertices. We extend this result to hypergraphs, using the maximum hyperedge size as a second parameter.
Another key component of our algorithm is an orbit-shrinking technique that preserves permutations that move few points and that may be of independent interest. Applying it to a suitable subgroup of the automorphism group allows us to switch from bounded hyperedge size to bounded color classes in the exactly-k case
CNF Satisfiability in a Subspace and Related Problems
We introduce the problem of finding a satisfying assignment to a CNF formula that must further belong to a prescribed input subspace. Equivalent formulations of the problem include finding a point outside a union of subspaces (the Union-of-Subspace Avoidance (USA) problem), and finding a common zero of a system of polynomials over ?? each of which is a product of affine forms.
We focus on the case of k-CNF formulas (the k-Sub-Sat problem). Clearly, k-Sub-Sat is no easier than k-SAT, and might be harder. Indeed, via simple reductions we show that 2-Sub-Sat is NP-hard, and W[1]-hard when parameterized by the co-dimension of the subspace. We also prove that the optimization version Max-2-Sub-Sat is NP-hard to approximate better than the trivial 3/4 ratio even on satisfiable instances.
On the algorithmic front, we investigate fast exponential algorithms which give non-trivial savings over brute-force algorithms. We give a simple branching algorithm with running time (1.5)^r for 2-Sub-Sat, where r is the subspace dimension, as well as an O^*(1.4312)? time algorithm where n is the number of variables.
Turning to k-Sub-Sat for k ? 3, while known algorithms for solving a system of degree k polynomial equations already imply a solution with running time ? 2^{r(1-1/2k)}, we explore a more combinatorial approach. Based on an analysis of critical variables (a key notion underlying the randomized k-SAT algorithm of Paturi, Pudlak, and Zane), we give an algorithm with running time ? {n choose {?t}} 2^{n-n/k} where n is the number of variables and t is the co-dimension of the subspace. This improves upon the running time of the polynomial equations approach for small co-dimension. Our combinatorial approach also achieves polynomial space in contrast to the algebraic approach that uses exponential space. We also give a PPZ-style algorithm for k-Sub-Sat with running time ? 2^{n-n/2k}. This algorithm is in fact oblivious to the structure of the subspace, and extends when the subspace-membership constraint is replaced by any constraint for which partial satisfying assignments can be efficiently completed to a full satisfying assignment. Finally, for systems of O(n) polynomial equations in n variables over ??, we give a fast exponential algorithm when each polynomial has bounded degree irreducible factors (but can otherwise have large degree) using a degree reduction trick
The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs
In this paper we study the complexity of the following problems:
1. Given a colored graph X=(V,E,c), compute a minimum cardinality set of vertices S (subset of V) such that no nontrivial automorphism of X fixes all vertices in S. A closely related problem is computing a minimum base S for a permutation group G <= S_n given by generators, i.e., a minimum cardinality subset S of [n] such that no nontrivial permutation in G fixes all elements of S. Our focus is mainly on the parameterized complexity of these problems. We show that when k=|S| is treated as parameter, then both problems are MINI[1]-hard. For the dual problems, where k=n-|S| is the parameter, we give FPT~algorithms.
2. A notion closely related to fixing is called individualization. Individualization combined with the Weisfeiler-Leman procedure is a fundamental technique in algorithms for Graph Isomorphism. Motivated by the power of individualization, in the present paper we explore the complexity of individualization: what is the minimum number of vertices we need to individualize in a given graph such that color refinement "succeeds" on it. Here "succeeds" could have different interpretations, and we consider the following: It could mean the individualized graph becomes: (a) discrete, (b) amenable, (c)compact, or (d) refinable. In particular, we study the parameterized versions of these problems where the parameter is the number of vertices individualized. We show a dichotomy: For graphs with color classes of size at most 3 these problems can be solved in polynomial time, while starting from color class size 4 they become W[P]-hard
Efficient Identity Testing and Polynomial Factorization in Nonassociative Free Rings
In this paper we study arithmetic computations in the nonassociative, and noncommutative free polynomial ring F{X}. Prior to this work, nonassociative arithmetic computation was considered by Hrubes, Wigderson, and Yehudayoff, and they showed lower bounds and proved completeness results. We consider Polynomial Identity Testing and Polynomial Factorization in F{X} and show the following results.
1. Given an arithmetic circuit C computing a polynomial f in F{X} of degree d, we give a deterministic polynomial algorithm to decide if f is identically zero. Our result is obtained by a suitable adaptation of the PIT algorithm of Raz and Shpilka for noncommutative ABPs.
2. Given an arithmetic circuit C computing a polynomial f in F{X} of degree d, we give an efficient deterministic algorithm to compute circuits for the irreducible factors of f in polynomial time when F is the field of rationals. Over finite fields of characteristic p,
our algorithm runs in time polynomial in input size and p
Extensor-coding
We devise an algorithm that approximately computes the number of paths of
length in a given directed graph with vertices up to a multiplicative
error of . Our algorithm runs in time . The algorithm is based on associating with
each vertex an element in the exterior (or, Grassmann) algebra, called an
extensor, and then performing computations in this algebra. This connection to
exterior algebra generalizes a number of previous approaches for the longest
path problem and is of independent conceptual interest. Using this approach, we
also obtain a deterministic time algorithm
to find a -path in a given directed graph that is promised to have few of
them. Our results and techniques generalize to the subgraph isomorphism problem
when the subgraphs we are looking for have bounded pathwidth. Finally, we also
obtain a randomized algorithm to detect -multilinear terms in a multivariate
polynomial given as a general algebraic circuit. To the best of our knowledge,
this was previously only known for algebraic circuits not involving negative
constants.Comment: To appear at STOC 2018: Symposium on Theory of Computing, June 23-27,
2018, Los Angeles, CA, US